Eigenvalues and the diameter of graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eigenvalues, diameter, and mean distance in graphs

It is well-known that the second smallest eigenvalue 22 of the difference Laplacian matrix of a graph G is related to the expansion properties of G. A more detailed analysis of this relation is given. Upper and lower bounds on the diameter and the mean distance in G in terms of 22 are derived.

متن کامل

The Diameter and Laplacian Eigenvalues of Directed Graphs

For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly connected directed graphs G, namely D(G) ≤ ⌊ 2minx log(1/φ(x)) log 2 2−λ ⌋ + 1 where λ is the first non-trivial eigenvalue of the Laplacian and φ is the Perron vector of the transition probability matrix of a random walk ...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

The diameter and Laplacian eigenvalues of directed graphs

For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly connected directed graphs G, namely D(G) ≤ ⌊ 2maxx log(1/φ(x)) log 2 2−λ ⌋ + 1 where λ is the first non-trivial eigenvalue of the Laplacian and φ is the Perron vector of the transition probability matrix of a random walk ...

متن کامل

On the eigenvalues of non-commuting graphs

The non-commuting graph $Gamma(G)$ of a non-abelian group $G$ with the center $Z(G)$ is a graph with thevertex set $V(Gamma(G))=Gsetminus Z(G)$ and two distinct vertices $x$ and $y$ are adjacent in $Gamma(G)$if and only if $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 1995

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081089508818378